Polytypic data conversion programs

Polytypic data conversion programs

Formal polytypic programs and proofs

The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic programming in the proof assistant Coq and provide an infrastructure for polytypic proofs. Polytypic functions are reified within Coq as a datatype and they can then be specialized by applying a dependently typed term speci...

Polytypic Proving

xv

Polytypic Programming

Many functions have to be written over and over again for different datatypes, either because datatypes change during the development of programs, or because functions with similar functionality are needed on diierent datatypes. Examples of such functions are pretty printers, debug-gers, equality functions, uniiers, pattern matchers, rewriting functions, etc. Such functions are called polytypic...

Polytypic Proof

This paper deals with formalizations and veriications in type theory that are abstracted with respect to a class of datatypes; i.e poly-typic constructions. The main advantage of these developments are that they can not only be used to deene functions in a generic way but also to formally state polytypic theorems and to synthesize polytypic proof objects in a formal way. This opens the door to ...